A note on the size of the largest ball inside a convex polytope
نویسندگان
چکیده
Let m > 1 be an integer, Bm the set of all unit vectors of R pointing in the direction of a nonzero integer vector of the cube [−1, 1]. Denote by sm the radius of the largest ball contained in the convex hull of Bm. We determine the exact value of sm and obtain the asymptotic equality sm ∼ 2 √ log m . Primary subject classification: 52B11 Secondary subject classification: 52B12 §
منابع مشابه
ul 2 00 5 A Note on the Size of the Largest Ball Inside a Convex Polytope Imre Bárány
Let Cm be the convex hull of Bm, and sm the radius of the largest ball contained in Cm. (Due to the apparent symmetries of Cm, such a largest ball is necessarily centered at the origin.) In the paper [B-M-S(2005)] (dealing with rotation numbers/vectors of billiards) we needed sharp lower and upper estimates for the extremal radius sm. Here we determine the exact value of sm which, of course, im...
متن کاملConvex Geometry of Orbits
We study metric properties of convex bodies B and their polars B, where B is the convex hull of an orbit under the action of a compact group G. Examples include the Traveling Salesman Polytope in polyhedral combinatorics (G = Sn, the symmetric group), the set of nonnegative polynomials in real algebraic geometry (G = SO(n), the special orthogonal group), and the convex hull of the Grassmannian ...
متن کاملSolving multiobjective linear programming problems using ball center of polytopes
Here, we aim to develop a new algorithm for solving a multiobjective linear programming problem. The algorithm is to obtain a solution which approximately meets the decision maker's preferences. It is proved that the proposed algorithm always converges to a weak efficient solution and at times converges to an efficient solution. Numerical examples and a simulation study are used to illu...
متن کاملOn the von Neumann and Frank-Wolfe Algorithms with Away Steps
The von Neumann algorithm is a simple coordinate-descent algorithm to determine whether the origin belongs to a polytope generated by a finite set of points. When the origin is in the interior of the polytope, the algorithm generates a sequence of points in the polytope that converges linearly to zero. The algorithm’s rate of convergence depends on the radius of the largest ball around the orig...
متن کاملProblems from CGCS
Most of these problems were presented at the conference on Combinatorics, Geometry and Computer Science, held at CIRM, Luminy, 2-4 May 2007. I have added one problem on a similar theme after the meeting. The problems have been arranged so that those with similar themes occur together as far as possible. 1. Nearly round polytopes Communicated by Komei Fukuda. We call a polytope centered if it co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Periodica Mathematica Hungarica
دوره 51 شماره
صفحات -
تاریخ انتشار 2005